package com.study.dataStructure.tree;

/**
 * @author tiny
 * @date 2021/12/14 16:01
 * @Description:
 */
public class ArrayBinaryTreeDemo {

    public static void main(String[] args) {
        ArrayBinaryTree tree = new ArrayBinaryTree(new int[]{1, 2, 3, 4, 5, 6, 7});
//        tree.preShow(); //前序遍历 预计:  1, 2, 4, 5, 3, 6, 7
//        tree.midShow(); //中序遍历 预计: 4, 2, 5, 1, 6, 3, 7


        tree.postShow(); // 后序遍历 预计: 4, 5, 2, 6, 7, 3, 1
    }

}
